#include <bits/stdc++.h>
using namespace std;
int t;
int l, r, k;
int main() {
	freopen("a.in", "r", stdin);
	freopen("a.out", "w", stdout);
	scanf("%d", &t);
	while (t--) {
		scanf("%d%d%d", &l, &r, &k);
		if (l == r) {
			if (l == 1) {
				puts("NO");
				continue;
			}
			else {
				puts("YES");
				continue;
			}
		}
		int tmp = (r - l + 1) / 2;
		if ((l & 1) && (r & 1)) ++tmp;
		puts(k >= tmp ? "YES" : "NO");
	}
	return 0;
}

#include <bits/stdc++.h>
#define N 200010
#define mod 998244353ll
using namespace std;
using ll = long long;
int n, k;
int a[N], s[N];
ll ans;
int tot;
ll fact[N << 1], nifact[N << 1];
inline ll qp(ll x, ll y) {
	ll ans = 1;
	while (y) {
		if (y & 1) ans = ans * x % mod;
		y >>= 1;
		x = x * x % mod;
	}
	return ans;
}
inline ll c(ll x, ll y) {
	return fact[x] * nifact[y] % mod * nifact[x - y] % mod;
}
int main() {
	freopen("b.in", "r", stdin);
	freopen("b.out", "w", stdout);
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", a + i);
		++s[a[i]];
	}
	fact[0] = 1;
	nifact[0] = 1;
	for (int i = 1; i <= n + k; ++i) {
		fact[i] = fact[i - 1] * i % mod;
		nifact[i] = qp(fact[i], mod - 2);
	}
	for (int i = 0; i < k + tot; ++i) {
		ans += c(k + tot - 1, i);
		ans %= mod;
//		cout << ans << endl;
		if (i < N && s[i]) ++tot;
	}
	printf("%lld", ans);
	return 0;
}

#include <bits/stdc++.h>
#define N 10010
using namespace std;
using ll = long long;
int t, n;
ll k;
ll a[N], b[N];
ll stk[N], top;
int main() {
	freopen("c.in", "r", stdin);
	freopen("c.out", "w", stdout);
	scanf("%d", &t);
	while (t--) {
		scanf("%d%lld", &n, &k);
		for (int i = 0; i < n; ++i) {
			scanf("%lld", a + i);
		}
		for (int i = 0; i < n; ++i) {
			scanf("%lld", b + i);
		}
		top = 0;
		for (int i = n - 1; ~i; --i) {
			ll tmp = a[i] ^ b[i];
//			cerr << tmp << ' ';
			if (top && tmp == stk[top] && a[i] + b[i] <= k) --top;
			else {
				stk[++top] = tmp;
			}
		}
//		cerr << endl;
		if (top) puts("YES");
		else puts("NO");
	}
	return 0;
}